System and method for generating soft output in hybrid MIMO systems

ABSTRACT

A hybrid soft output MIMO detector uses a QR decomposition detector followed by a Markov chain Monte Carlo detector. The QRD-M generates initial candidate decision vectors, which are used as input for the Markov chain Monte Carlo detection to generate the soft output.

FIELD OF THE INVENTION

This invention relates generally to a wireless communication system between transceivers having with multiple antennas, and more particularly to generating soft output for a received signal using spatial multiplexing.

BACKGROUND OF THE INVENTION

Multiple input, multiple output (MIMO) wireless communication systems use multiple transmit and receive antennas at transceivers to increase diversity using space and time coding. MIMO systems can also increase the data rate by using spatial multiplexing. There is a fundamental tradeoff between the increase in diversity and data rate for MIMO systems.

The most challenging part of detecting received signals in a MIMO system with spatial multiplexing is an exponential increase in the complexity of the receiver when a maximal a posterior (MAP) detector is used. This makes it difficult to implement a MAP detector in practical systems.

Most of prior art detection methods for MIMO receivers can be classified into, but not limited to the following categories: linear; tree based; and Markov chain Monte Carlo (MCMC) detection.

Linear detection is the simplest. Similar to multi-user detection in a CDMA system, the interference from other antennas is successively suppressed by zero forcing (ZF) or minimal mean square error (MMSE) equalization. Thus, the MIMO detection is turned into a set of parallel single input, single output (SISO) detection problems. Therefore, linear detection is also called successive interference cancellation (SIC). However, ZF and MMSE are suboptimal.

Although linear detection has a very low complexity, there are several drawbacks. While suppressing the interference, part of the useful signal energy is cancelled because the channels of different antennas are usually not orthogonal, thus noise energy can increase. Linear detection also suffers from the error propagation from different antennas, and hence the spatial diversity order is reduced to one.

Vertical-Bell Labs Layered Space Time (V-BLAST) is an improved version of SIC. V-BLAST performs the SIC process in the order of the transmit antenna with a largest signal strength. The performance is improved because the error propagation is reduced with such an ordered scheme.

The tree based detection can theoretically achieve optimal performance by selecting a large sphere (in sphere decoding), or M parameter in a QR decomposition (QRD-M). The QRD-M decomposes a channel matrix H as H=QR based on a modified Gram-Schmidt (MGS) method, where Q is an N_(r)×N_(t), unitary matrix and R is an N_(t)×N_(t) upper triangular matrix, and N_(t) and N_(r) are the number of transmit and receive antennas, respectively. Tree based detection has a significant lower complexity than MAP detection. The tree based detector first applies the QRD-M over the channel matrix H to form a tree. The Euclidean distance is determined along paths of the tree from the root node to the leaf nodes. At each level of the tree, some paths are eliminated based on some criteria to lower the complexity.

For QRD-M, only M paths with a smallest accumulated Euclidean distance are selected. For the sphere decoding method, the paths with accumulated Euclidean distance smaller than a predefined sphere radius are selected. The complexity of tree detection corresponds to the parameter M for the QRD-M, and the sphere radius for sphere decoding.

While tree detection has a reduced complexity, when compared with the MAP detection, there are still some drawbacks for practical implementations. The sphere decoding has a variable complexity depending on a signal-to-noise (SNR). The complexity at lower SNR is significantly higher than at higher SNR, which means an uncontrollable delay. QRD-M has a constant complexity, which on the average is larger than sphere decoding. Another disadvantage of the QRD-M method is that it uses a time consuming sorting procedure, which introduces long delays. For example, if the system has four transmit and receive antennas, then for 64 quadrature amplitude modulation (QAM), M=64 should be used to obtain good performance. Therefore, at each layer of the tree, the QRD-M method needs to sort 64×64=4096 accumulated Euclidean distances to select 64 minimal distances, which leads to long delay. The conventional Quicksort procedure needs mlog₂M comparisons, where m is the number of items to be sorted. The sorting procedure is difficult to implement in parallel, which precludes hardware implementations.

The Markov chain Monte Carlo (MCMC) detection is near optimal. Similar to tree detection, MCMC detection also performs limited search over a subset of candidate samples to decrease the complexity. However, instead of tree based search, the MCMC detection uses a Markov chain based search. By using a set of parallel Markov chains, whose stationary distribution follows the channel probability density function (PDF), candidate samples with large probabilities are generated efficiently. The candidate samples are then used to determine the Euclidean distances. The MCMC detection can achieve better performance and decreased average complexity at a low SNR, as well for larger dimension problem. At a high SNR, the performance is worse than at the low SNR. This is because the Markov chains take a long time to reach stable states at a high SNR.

Therefore, it is desired to provide a MIMO detector with low complexity and for a wide range of SNR conditions.

SUMMARY OF THE INVENTION

A hybrid soft output MIMO detector uses a QR decomposition detector followed by a Markov chain Monte Carlo detector. The QRD-M generates initial candidate decision vectors, which are used as input for the Markov chain Monte Carlo detection to generate the soft output.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is a block diagram of a spatial multiplexing MIMO system used by the embodiments of the invention;

FIG. 1B is a block diagram of a first transceiver operating in transmit mode and a second transceiver operating in receive mode according to an embodiment of the invention;

FIG. 2 is a block diagram of a MIMO receiver used by embodiments of the invention;

FIG. 3 is a block diagram of a MIMO detector according to embodiments of the invention; and

FIG. 4 is a block diagram of a method for generating soft output in a MIMO receiver according to the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

MIMIO System

The embodiments of the invention provide a method and system for MIMO detection with low complexity and latency for a wide range of SNR conditions. The invention provides a hybrid soft output MIMO detector that combines QR decomposition (QRD-M) detection followed by Markov chain Monte Carlo (MCMC) detection to generate soft output, which is near optimal for widely varying SNR conditions.

FIG. 1A shows a spatial multiplexing MIMO system used by the embodiments of the invention. The system includes multiple transceivers 10. Each transceiver includes a set of antennas 11. Each transceiver can operate in either transmit (TX) or receive (RX) mode. In TX mode, the antennas are connected to transmit RF chains, and in RX mode the same antennas can be connected to receive RF chains. Signals 12 are transmitted via channels 15 subject to noise.

FIG. 1B shows a first transceiver 10 operating in transmit mode by having a transmitter (TX) 101 connected to a set of transmit antennas 111. A second transceiver operates in receive mode by having a receiver (RX) 200 connected to a set of receive antennas 122.

In the transmitter 101, spatial multiplexing concurrently transmits independent data streams via the TX antennas 111, thereby increasing the data throughput. Interference can occur at the receivers because of the multiplexing of independent received data stream. A MIMO detection method and apparatus separates the data stream at the receiver.

In our hybrid MIMO system with N_(t) TX antennas 111 and N_(r) of RX antennas 122, the relation of the TX and the RX signals is y=Hd+n,   (1) where y ε C^(N) ^(t) is the received signal vector and d ε C^(N) ^(t) is the transmitted signal vector, H ε C^(N) ^(r) ^(×N) ^(t) is a channel matrix in which an element h_(i,j) is an impulse response of the channels between an i^(th) RX antenna and a j^(th) TX antenna, and n ε C^(N) ^(t) is a noise vector at the receiver. Herein, variables in lower case bold are vectors, and variables in upper case bold are matrices, as used in conventional notation.

MIMO Receiver

FIG. 2 shows a general structure of our hybrid MIMO receiver 200. The receiver includes a MIMO detector 300 according to embodiments of our invention, a channel decoder 202, and a hard decision unit 203. Convolutional, turbo, or low-density parity-check (LDPC) codes are generally used in MIMO wireless communication systems. Such codes need a soft output λ as input to the decoder 202.

As defined conventionally, a soft output includes an approximate confidence measure (probability P) indicating a reliability of a decision bit in the decision vector d, hence we use the notation {circumflex over (d)} indicate the estimate of the received decision vector, which corresponds to the transmitted signals.

Therefore, our soft output MIMO detector 300 generates the soft output for the channel decoder 202. In contrast to a conventional one-shot receiver, where detection and decoding is performed only one time, our receiver 200 performs iterative detection and decoding to obtain better performance. Therefore, the output from the channel decoder 202 is feed back 204 to the detector 300 to improve the detection.

For an optimal maximal a posterior (MAP) MIMO detector, the soft output is

$\begin{matrix} \begin{matrix} {\lambda_{k} = {\ln\frac{P\left( {b_{k} = \left. {+ 1} \middle| y \right.} \right)}{P\left( {b_{k} = \left. {- 1} \middle| y \right.} \right)}}} \\ {= {\ln\frac{\sum\limits_{b_{- k}}{P\left( {{b_{k} = {+ 1}},\left. b_{- k} \middle| y \right.} \right)}}{\sum\limits_{b_{- k}}{P\left( {{b_{k} = {- 1}},\left. b_{- k} \middle| y \right.} \right)}}}} \\ {{\approx {\ln\frac{\max\limits_{b_{- k}}{P\left( {{b_{k} = {+ 1}},\left. b_{- k} \middle| y \right.} \right)}}{\max\limits_{h_{- k}}{P\left( {{b_{k} = {- 1}},\left. b_{- k} \middle| y \right.} \right)}}}},} \end{matrix} & (2) \end{matrix}$ where the vectors d=(b₁, b₂, . . . b_(N) _(t) _(M) _(c) ); b_(−k)=(b₁, . . . b_(k−1), b_(k+1), . . . , b_(N) _(t) _(M) _(c) ); b_(i) ε {−1,1}, are the received vector and the received vector without bit b_(k), respectively, k is the index of the bit under detection, M_(c) is the number of bits for each constellation symbol, and λ_(k) the soft output for bit b_(k). The last term of Equation (2) is a maximum-logarithmic approximation version of MAP detection (max-log MAP). Hereinafter, we consider only the max-log MAP detection, without loss of generality.

To evaluate Equation (2), an exhaustive search over all the combinations of the decision vector d would have to be performed. This has a complexity of 2^(N) ^(t) ^(M) ^(c) . We call the combinations of the decision vectors d a set of candidate decision vectors.

To reduce the complexity, we limit the search over a subset of the set of candidate decision vectors. An ideal subset includes only the “maximal terms” to be evaluated by the Equation (2). However, it is NP-hard to construct an ideal subset. Therefore, our near optimal hybrid method constructs a subset, which has a high probability to include the “maximal terms,” or terms whose values are close to the “maximal terms.” We call the subset with such properties as an “important subset.” A size of the important subset is a measure of its complexity.

We use QRD-M and MCMC detection in a hybrid MIMO receiver to construct the important subset efficiently.

MCMC Detection

As described above, the MCMC detector uses a set of parallel Markov chains to generate samples. Because the stationary distribution of the Markov chains follow the conditional PDF P(y|d)of the channel, when Markov chains reach stable states, the samples are generated according to P(y|d). Therefore, the subset that includes those samples is the “important subset.”

MCMC detection is as follows:

Generate an initial decision vector d⁽⁰⁾ randomly for n = 1 to I   generate  d₀^((n))  from  distribution  p(d₀ = b|d₁^((n − 1)), d₂^((n − 1)), … , d_(N_(t)M_(c) − 1)^((n − 1)), y)   generate  d₁^((n))  from  distribution  p(d₁ = b|d₀^((n)), d₂^((n − 1)), … , d_(N_(t)M_(c) − 1)^((n − 1)), y)  

  generate  d_(N_(t)M_(c) − 1)^((n))   from  distribution  p(d_(N_(t)M_(c) − 1) = b|d₀^((n)), d₁^((n)), … , d_(N_(t)M_(c) − 2)^((n)), y) end for In  the  above  procedure, p(d_(i) = b|d₀^((n)), …  d_(i − 1)^((n)), d_(i + 1)^((n − 1)), … , d_(N_(t)M_(c) − 1)^((n − 1)), y) ∝  p(y|d₀^((n)), …  d_(i − 1)^((n)), d_(i) = b, d_(i + 1)^((n − 1)), … , d_(N_(t)M_(c) − 1)^((n − 1)),)  p(d_(i) = b), M_(c) is the number of bits per constellation symbol, I is the number of iterations, d⁽⁰⁾ is the initial candidate decision vector, d_(i) ^((n)) is the i^(th) bit generated at the n^(th) iteration.

To speed up the convergence of the MCMC detector 306, several MCMC detections can be preformed independently in parallel. The complexity of the MCMC detector depends on the number of parallel MCMC detectors, and the number of iterations performed by each MCMC detector.

The MCMC detector works well at a relatively low SNR. A small subset of decision vectors is constructed, which makes the complexity of MCMC detection relatively low. Also the complexity of MCMC detector does not increase exponentially with the increase in the number of antennas or constellation size. In addition, the parallel structure can be implemented in hardware.

However, as stated above, the MCMC detector is slow to convergence at a relatively high SNR. This increased latency introduces delays. This is because of the multi-model property of the PDF of the channel. The multi-model property of the channel PDF means that the channel PDF has many local maximal points. Thus, the MCMC can only transition from a current state to an adjacent state (adjacent meaning only one bit difference in the decision vector d) with transition distribution

p(d_(i) = b|d₀^((n)), …  d_(i − 1)^((n)), d_(i + 1)^((n − 1)), …  , d_(N_(t)M_(c) − 1)^((n − 1)), y).

At a relatively low SNR, the difference of the probability values between local maximal points and adjacent points is usually small. Therefore, the MCMC detector can easily transit from a local maximal state to an adjacent maximal state. However, at a relatively high SNR, the difference of probability values can be quite large. Therefore, the MCMC detector may get ‘trapped’ at a local maximal state, which is not globally optimal, and takes a long time to converge.

Prior art techniques have used a ZF or a MMSE detector to generate the initial candidate vectors for the MCMC detector. However, those techniques can only partially solved the problem, because both the ZF and MMSE detectors are suboptimal as stated above.

QRD-M Detection

According to the embodiments of the invention as shown in FIG. 3, a QRD-M detection 305 is preformed first, before the following MCMC detection 306. The decision vectors generated by the QRD-M are used by the MCMC detector as the initial set of candidate decision vectors.

As an advantage of our invention, a small M parameter for the QRD-M is sufficient to obtain a near optimal set of candidate decision vectors for the hybrid receiver. For example, M can be 12, instead of 64 as in the prior art QRD-M detector.

Furthermore, the complexity is reduced because the parameter M is small. Even at a low SNR, the small M parameter ensures the MCMC detector starts at near optimal states. Because the MCMC detector starts at a near optimal state, the number of parallel Markov chains and the number of iterations are reduced. In addition, the QRD-M method also reduces the time to determine the Euclidean distances.

Hybrid MIMO Detector

FIG. 3 shows the MIMO detector 300 according to embodiments of the invention. A method 400 of operation of the detector 300 is shown in FIG. 4.

The detector includes the N_(r) receive antennas 122, a channel estimation unit 302, a QR decomposition unit 303, a preprocessing unit 304, a QRD-M detection unit 305, a MCMC detection unit 306, and a log-likelihood ratio (LLR) unit 307.

Received signals y 401 are received by the receive antennas 122. The received signal can be a training message or a data stream. The received signals are passed to the channel estimation unit 302 and the preprocessing unit 304. The channel estimation unit estimates 410 the channel matrix H 411, see FIG. 4.

The channel matrix H is sent to QR decomposition unit 303 to generate a unitary matrix Q and upper triangular channel matrix R. The preprocessing unit 304 determines Q^(H)y and for both the QRD-M detection unit and the MCMC detection unit.

The QRD-M detection unit constructs an initial important subset. The initial important subset is sent to the MCMC detection unit as initial candidate decision vectors 421. A refined important subset is generated by the MCMC unit, and the soft output 431 is determined over the refined important subset.

In the QRD-M unit 303, the QR decomposition is performed over the estimated channel matrix as r=Q ^(H) y=Q ^(H) Hd+Q ^(H) n=Rd+Q ^(H) n,   (3) where H=QR, Q ε C^(N) ^(r) ^(×N) ^(r) is the unitary matrix and

${R = \begin{bmatrix} T \\ 0_{{N_{r} - N_{t}},N_{t}} \end{bmatrix}},$ where T ε C^(N) is t^(×N) ^(t) is the upper-triangular matrix.

In the preprocessing unit 304, the values of Q^(H)y and Rd are determined for both the QRD-M detection unit 305 and the MCMC detection unit 306.

The complexity of the Euclidean distance computation in the MCMC detection unit 306 is reduced by the present invention as follows.

The conventional Euclidean distance computation in conventional MCMC detection is

$\begin{matrix} {{\omega }^{2} = {\sum\limits_{k = 1}^{N_{r}}{{{y_{k} - {\sum\limits_{l = 1}^{N_{t}}{h_{k,l}d_{l}}}}}^{2}.}}} & (3) \end{matrix}$ where |ω|² is the Euclidean distance, and y_(k) is the received symbol at k^(th) receive antenna, h_(k,l) is the impulse response of the channel between the l^(th) transmit antenna and the k^(th) receive antenna, and d_(l) is candidate symbol transmitted from by the l^(th) transmitter.

In the MCMC detection unit 306 according to embodiments of the invention, the Euclidean distance is determined by

$\begin{matrix} {{\omega }^{2} = {\sum\limits_{k = 1}^{N_{t}}{{{r_{k} - {\sum\limits_{l = k}^{N_{t}}{t_{k,l}d_{l}}}}}^{2}.}}} & (5) \end{matrix}$ where r_(k),t_(k,l),d_(l) are the entries of R,T,d, respectively.

With this approach, the complexity of our detection is decreased by at least half compared with the convention MCMC detection.

The complexity is reduced by using the Euclidean distance of a previous state, which is described as follows.

-   1) Determine the Euclidean distance of the initial state     ω(0),|ω(0)|². We store the distance metric and the square root of     the distance metric. -   2) At each state transition of the Markov chain, the Euclidean     distance of the next state i+1 is determined using the previously     stored Euclidean distances ω_(i), ω_(i) ². At each state transition,     only one bit changes. If one bit of the symbol transmitted by     antenna l(1≦l≦N_(t)) is changed, then the Euclidean distance is

$\begin{matrix} {\begin{matrix} {{\omega_{k}\left( {i + 1} \right)} = {{\omega_{k}(i)} + {t_{k,l}{d_{l}(i)}} - {t_{k,l}{d_{l}\left( {i + 1} \right)}}}} \\ {{= {{\omega_{k}(i)} - \phi}};} \end{matrix}{0 \leq k \leq l}{{{\omega_{k}\left( {i + 1} \right)}}^{2} = {{{\omega_{k}(i)}}^{2} - {2\mspace{11mu}\text{Re}\left( {{\omega_{k}(i)}\phi^{*}} \right)} + {\phi }^{2}}}{{{\omega\left( {i + 1} \right)}}^{2} = {\sum\limits_{k = 0}^{l}{{\omega_{k}\left( {i + 1} \right)}}^{2}}}} & (6) \end{matrix}$ where Re() is tie real part of a complexity number and φ represents t_(k,l)d_(l)(i)−t_(k,l)d_(l)(i+1) for convenience.

Because |ω_(k)(i)|² and |φ=t_(k,l)d_(l)(i)−t_(k,l)d_(l)(i+1)|² are predetermined, only

${2\frac{N_{t} + 1}{2}} = {N_{t} + 1}$ multiplications are required, reducing the complexity of our hybrid receiver.

As shown in FIG. 4, signals y 401 are received at multiple received antennas via corresponding channels to transmit antennas. A channel matrix H 411 is estimated. The channel matrix H is decomposed to matrices QR using a QR decomposition. The matrices are used to determine 420 candidate decision vectors 421 in a QRD-M decision unit. The candidate decision vectors are input to a MCMC decision unit to determine 430 the soft output 431. The soft output can than be input to a channel decoding unit 440 to generate the decision vector {circumflex over (d)} 402, which is a best estimate of the corresponding transmitted signals d.

Effect of the Invention

The embodiments of the invention provide a method and system for MIMO detection with low complexity and latency for a wide range of SNR conditions. Although, the exact SNR range depends on the channel model, constellation size, number of antennas, channel codes, the invention can achieve about 1 dB gain over a conventional QRD-M detector.

Although the invention has been described with reference to certain preferred embodiments, it is to be understood that various other adaptations and modifications can be made within the spirit and scope of the invention. Therefore, it is the object of the append claims to cover all such variations and modifications as come within the true spirit and scope of the invention. 

1. A method for generating soft output for a received signal in a multiple input, multiple output (MIMO) receiver, comprising: estimating a channel matrix H from signals y received at a plurality of antennas via corresponding channels; decomposing, using M parameters, the channel matrix H to obtain a unitary matrix Q and upper triangular matrix R; determining, in an M parameter QR decomposition (QRD-M) detection unit, a set of candidate decision vectors based on the matrices Q and R and the received signals y; determining, in a Markov chain Monte Carlo (MCMC) detection unit, an important subset of the set of candidate decision vectors; and determining, in a log-likelihood ratio unit, a soft output using the important subset, wherein a relation between transmitted signals d and the received signals y is y=Hd+n, where y ε C^(N) ^(r) is a vector of the received signals, d ε C^(N) ^(t) is a vector of the transmitted signals, H ε C^(N) ^(r) ^(×N) ^(t) is the channel matrix in which an element h_(i,j) is an impulse response of the channels between an i^(th) receive antenna and a j^(th) transmit antenna, and n ε C^(N) ^(r) is a noise vector, wherein the decomposition is performed over the channel matrix as r=Q ^(H) y=Q ^(H) Hd+Q ^(H) n=Rd+Q ^(H) n, where H=QR, Q ε C^(N) ^(r) ^(×N) ^(r) is the unitary matrix and ${R = \begin{bmatrix} T \\ 0_{{N_{r} - N_{t}},N_{t}} \end{bmatrix}},$ where T ε C^(N) ^(t) ^(×N) ^(t) is the upper-triangular matrix, and wherein the MCMC detection unit determines a Euclidean distances according to ${{\omega }^{2} = {\sum\limits_{k = 1}^{N_{t}}{{r_{k} - {\sum\limits_{l = k}^{N_{t}}{t_{k,l}d_{l}}}}}^{2}}},$ where |ω|² is the Euclidean distance, r_(k), t_(k,l),d_(l) are the entries of vectors r,d and matrix T.
 2. The method of claim 1, in which the signals y are independent of each other.
 3. The method of claim 1, in which the soft output includes an approximate confidence measure indicating a reliability of a decision bit in a decision vector {circumflex over (d)}, which is an estimate of the transmitted signals d.
 4. The method of claim 1, in which the received signals have a wide range of signal to noise ratio conditions.
 5. The method of claim 1, in which a preprocessing unit determines Q^(H)y and Rd for both the QRD-M detection unit and the MCMC detection unit.
 6. The method of claim 1, in which the Euclidean distance is modified according to ω_(k)(i + 1) = ω_(k)(i) + t_(k, l)d_(l)(i) − t_(k, l)d_(l)(i + 1) = ω_(k)(i) − ϕ; 0 ≤ k ≤ l ω_(k)(i + 1)² = ω_(k)(i)² − 2  Re(ω_(k)(i)ϕ^(*)) + ϕ² ${{{\omega\left( {i + 1} \right)}}^{2} = {\sum\limits_{k = 0}^{l}\;{{\omega_{k}\left( {i + 1} \right)}}^{2}}},$ where Re( )is a real part of a complexity number and φ represents t_(k, l)d_(l)(i) − t_(k, l)d_(l)(i + 1).
 7. The method of claim 1, further comprising: channel decoding the soft output to estimate the transmitted signals d.
 8. A transceiver including a transmitter and a receiver each of which is configured to be connectable to a set of antennas, and in which the receiver comprises: means for estimating a channel matrix H from signals y received at a plurality of antennas via corresponding channels; means for decomposing, using M parameters, the channel matrix H to obtain a unitary matrix Q and upper triangular matrix R; means for determining, in an M parameter QR decomposition (QRD-M) detection unit, a set of candidate decision vectors based on the matrices Q and R and the received signals y; means for determining, in a Markov chain Monte Carlo (MCMC) detection unit, an important subset of the set of candidate decision vectors; and means for determining, in a log-likelihood ratio unit, a soft output using the important subset, wherein a relation between transmitted signals d and the received signals y is y=Hd+n, where y ε C^(N) ^(r) is a vector of the received signals, d εC^(N) ^(t) is a vector of the transmitted signals, H ε C^(N) ^(r) ^(33 N) ^(t) is the channel matrix in which an element h_(i,j) is an impulse response of the channels between an i^(th) receive antenna and a j^(th) transmit antenna, and n ε C^(N) ^(r) is a noise vector, wherein the decomposition is performed over the channel matrix as r=Q ^(H) y=Q ^(H) Hd+Q ^(H) n=Rd+Q ^(H) n, where H=QR, Q ε C^(N) ^(r) ^(×N) ^(r) is the unitary matrix and ${R = \begin{bmatrix} T \\ 0_{{N_{r} - N_{t}},N_{t}} \end{bmatrix}},$ where T ε C^(N) ^(t) ^(×N) ^(t) is the upper-triangular matrix, and wherein the MCMC detection unit determines a Euclidean distances according to ${{\omega }^{2} = {\sum\limits_{k = 1}^{N_{r}}\;{{r_{k} - {\sum\limits_{l = k}^{N_{r}}\;{t_{k,l}d_{l}}}}}^{2}}},$ where |ω|² is the Euclidean distance, r_(k), t_(k,l),d_(l) are the entries of vectors r,d and matrix T. 